Community detection and graph partitioning
نویسندگان
چکیده
منابع مشابه
Community detection and graph partitioning
Many methods have been proposed for community detection in networks. Some of the most promising are methods based on statistical inference, which rest on solid mathematical foundations and return excellent results in practice. In this paper we show that two of the most widely used inference methods can be mapped directly onto versions of the standard minimum-cut graph partitioning problem, whic...
متن کاملSpectral methods for network community detection and graph partitioning
We consider three distinct and well studied problems concerning network structure: community detection by modularity maximization, community detection by statistical inference, and normalized-cut graph partitioning. Each of these problems can be tackled using spectral algorithms that make use of the eigenvectors of matrix representations of the network. We show that with certain choices of the ...
متن کاملA study of graph partitioning schemes for parallel graph community detection
This paper presents a study of graph partitioning schemes for parallel graph community detection on distributed memory machines. We investigate the relationship between graph structure and parallel clustering effectiveness, and develop a heuristic partitioning algorithm suitable for modularity-based algorithms. We demonstrate the accuracy and scalability of our approach using several real-world...
متن کاملApplications to network analysis: Graph partitioning and community detection Lecture notes
• Denote by |S| its cardinality (that is, the number of its elements), by S̄ its complement (that is, S̄ = V \ S) and by 1S its characteristic vector, that is (1S)i = 1 if i ∈ S and 0 otherwise. • Let volS = ∑ i∈S di be the volume of S (recall that di is the degree of node i). Note: volS = d1S . • Let ein(S) = 1SA1S and eout(S) = 1SA(1 − 1S) = volS − ein(S). Note: eout(S) is the number of edges j...
متن کاملGraph Partitioning and Graph Clustering
We present an overview over our graph partitioners KaFFPa (Karlsruhe Fast Flow Partitioner) and KaFFPaE (KaFFPa Evolutionary). KaFFPa is a multilevel graph partitioning algorithm which on the one hand uses novel local improvement algorithms based on max-flow and min-cut computations and more localized FM searches and on the other hand uses more sophisticated global search strategies transferred...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2013
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/103/28003